By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 18, Issue 4, pp. 639-857

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Matrix Padé Fractions and Their Computation

George Labahn and Stan Cabay

pp. 639-657

BibTeX  Abstract Full Text:  PDF

Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix

Costas S. Iliopoulos

pp. 658-669

BibTeX  Abstract Full Text:  PDF

Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine Equations

Costas S. Iliopoulos

pp. 670-678

BibTeX  Abstract Full Text:  PDF

On the Complexity of Partial Order Productions

Andrew Chi-Chih Yao

pp. 679-689

BibTeX  Abstract Full Text:  PDF

A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs

Barbara B. Simons and Manfred K. Warmuth

pp. 690-710

BibTeX  Abstract Full Text:  PDF

Minimum-Knowledge Interactive Proofs for Decision Problems

Zvi Galil, Stuart Haber, and Moti Yung

pp. 711-739

BibTeX  Abstract Full Text:  PDF

An Optimal Synchronizer for the Hypercube

David Peleg and Jeffrey D. Ullman

pp. 740-747

BibTeX  Abstract Full Text:  PDF

Space-Time Trade-Offs for Orthogonal Range Queries

Pravin M. Vaidya

pp. 748-758

BibTeX  Abstract Full Text:  PDF

A Lower Bound for Matrix Multiplication

Nader H. Bshouty

pp. 759-765

BibTeX  Abstract Full Text:  PDF

Time/Space Trade-Offs for Reversible Computation

Charles H. Bennett

pp. 766-776

BibTeX  Abstract Full Text:  PDF

Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm: A Study of a Functional Equation

Philippe Jacquet and Wojciech Szpankowski

pp. 777-791

BibTeX  Abstract Full Text:  PDF

An Optimal-Time Algorithm for Slope Selection

Richard Cole, Jeffrey S. Salowe, W. L. Steiger, and Endre Szemerédi

pp. 792-810

BibTeX  Abstract Full Text:  PDF

Fully Dynamic Point Location in a Monotone Subdivision

Franco P. Preparata and Roberto Tamassia

pp. 811-830

BibTeX  Abstract Full Text:  PDF

On the Limit Sets of Cellular Automata

Karel Culik II, Jan Pachl, and Sheng Yu

pp. 831-842

BibTeX  Abstract Full Text:  PDF

Efficient Message Routing in Planar Networks

Greg N. Frederickson and Ravi Janardan

pp. 843-857

BibTeX  Abstract Full Text:  PDF